Boltzmann samplers forv-balanced cycles
نویسندگان
چکیده
منابع مشابه
Boltzmann Samplers for v-balanced Colored Necklaces
This paper is devoted to the random generation of particular colored necklaces for which the number of beads of a given color is constrained (these necklaces are called v-balanced). We propose an efficient sampler (its expected time complexity is linear) which satisfies the Boltzmann model principle introduced by Duchon, Flajolet, Louchard and Schaeffer (7). Our main motivation is to show that ...
متن کاملBoltzmann Samplers, Pólya Theory, and Cycle Pointing
We introduce a general method to count unlabeled combinatorial structures and to efficiently generate them at random. The approach is based on pointing unlabeled structures in an “unbiased” way that a structure of size n gives rise to n pointed structures. We extend Pólya theory to the corresponding pointing operator, and present a random sampling framework based on both the principles of Boltz...
متن کاملBoltzmann Samplers for Colored Combinatorial Objects
In this paper, we give a general framework for the Boltzmann generation of colored objects belonging to combinatorial constructible classes. We propose an intuitive notion called profiled objects which allows the sampling of size-colored objects (and also of k-colored objects) although the corresponding class cannot be described by an analytic ordinary generating function. Efficient generation ...
متن کاملBoltzmann samplers for first-order differential specifications
In the framework of analytic combinatorics, Boltzmann models give rise to efficient algorithms for the random generation of combinatorial objects. This paper proposes an efficient Boltzmann sampler for ordered structures defined by first-order differential specifications. Under an abstract real-arithmetic computation model, our algorithm is of linear complexity for free generation; in addition,...
متن کاملProperties of Random Graphs via Boltzmann Samplers
This work is devoted to the understanding of properties of random graphs from graph classes with structural constraints. We propose a method that is based on the analysis of the behaviour of Boltzmann sampler algorithms, and may be used to obtain precise estimates for the maximum degree and maximum size of a biconnected block of a “typical” member of the class in question. We illustrate how our...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2013
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2012.03.048